Multi Class Classification with Polyhedral Conic Functions1
نویسندگان
چکیده
1. Mathematical model. 1.1. Multi objective integer programming model. A kmesindeki her a1, a2, . . . , am noktas iin kar gelen KF’ler srasyla g1, g2, . . . , gm olsun. Bu fonksiyonlarn elde edilmesinin ardndan, her fonksiyonun hangi noktalar ayrdn gsteren bir Pm×m matrisi, eer A kmesindeki i. nokta, ai, l. fonksiyon ile ayrlyor ise Pil = 1, dier durumda Pil = 0 olacak ekilde oluturulsun. Bu aamada amacmz, en az sayda fonksiyon kullanarak A kmesindeki mmkn olabilecek en ok noktay B kmesinden ayracak fonksiyonlar semektir. Bu problemi zmek iin nerilen tamsayl matematiksel programlama yaklam izleyen ekilde verilmitir.
منابع مشابه
Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs
In this paper, under a suitable regularity condition, we establish that a broad class of conic convex polynomial optimization problems, called conic sum-of-squares convex polynomial programs, exhibits exact conic programming relaxation, which can be solved by various numerical methods such as interior point methods. By considering a general convex cone-program, we give unified results that appl...
متن کاملRisk optimization with p-order conic constraints: A linear programming approach
The paper considers solving of linear programming problems with p-order conic constraints that are related to a certain class of stochastic optimization models with risk objective or constraints. The proposed approach is based on construction of polyhedral approximations for p-order cones, and then invoking a Benders decomposition scheme that allows for efficient solving of the approximating pr...
متن کاملForthcoming in Mathematical Programming CONIC MIXED-INTEGER ROUNDING CUTS
A conic integer program is an integer programming problem with conic constraints. Many problems in finance, engineering, statistical learning, and probabilistic optimization are modeled using conic constraints. Here we study mixed-integer sets defined by second-order conic constraints. We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures ...
متن کاملConic mixed-integer rounding cuts
A conic integer program is an integer programming problem with conic constraints.Manyproblems infinance, engineering, statistical learning, andprobabilistic optimization aremodeled using conic constraints. Herewe studymixed-integer sets definedby second-order conic constraints.We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second...
متن کاملMixed integer programming with a class of nonlinear convex constraints
We study solution approaches to a class of mixed-integer nonlinear programming problems that arise from recent developments in risk-averse stochastic optimization and contain second-order and p-order cone programming as special cases. We explore possible applications of some of the solution techniques that have been successfully used in mixed-integer conic programming and show how they can be g...
متن کامل